Optimizing MSE for Clustering with Balanced Size Constraints
نویسندگان
چکیده
منابع مشابه
Data clustering with size constraints
Article history: Received 25 January 2010 Received in revised form 29 April 2010 Accepted 13 June 2010 Available online 13 July 2010
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملFuzzy and Probabilistic Clustering with Shape and Size Constraints
More sophisticated fuzzy clustering algorithms, like the Gustafson–Kessel algorithm [11] and the fuzzy maximum likelihood estimation (FMLE) algorithm [10] offer the possibility of inducing clusters of ellipsoidal shape and different sizes. The same holds for the expectation maximization (EM) algorithm for a mixture of Gaussians. However, these additional degrees of freedom can reduce the robust...
متن کاملOptimizing Covertimes with Constraints By
Microtubules are long rigid polymers found in nearly all eukaryotic cells. They are an essential part of the cytoskeleton and are responsible for a variety of intracellular processes. Microtubules locate objects in intracellular space by changing their length through the process of dynamic instability. In this thesis we develop and study both a discrete and a continuous model for microtubule gr...
متن کاملBalanced K-Means for Clustering
We present a k-means-based clustering algorithm, which optimizes mean square error, for given cluster sizes. A straightforward application is balanced clustering, where the sizes of each cluster are equal. In k-means assignment phase, the algorithm solves the assignment problem by Hungarian algorithm. This is a novel approach, and makes the assignment phase time complexity O(n), which is faster...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2019
ISSN: 2073-8994
DOI: 10.3390/sym11030338